COMPUTING THE BOXICITY OF A GRAPH BY COVERING ITS COMPLEMENT BY COINTERVAL GRAPHSCOZZENS MB; ROBERTS FS.1983; DISCRETE APPLIED MATHEMATICS; ISSN 0166-218X; NLD; DA. 1983; VOL. 6; NO 3; PP. 217-228; BIBL. 24 REF.Article

BIPARTITE INTERSECTION GRAPHSHARARY F; KABELL JA; MCMORRIS FR et al.1982; COMMENTAT. MATH. UNIV. CAROL.; ISSN 0323-0171; CSK; DA. 1982; VOL. 23; NO 4; PP. 739-745; BIBL. 9 REF.Article

COMPARABILITY GRAPHS AND INTERACTION GRAPHSGOLUMBIC MC; ROTEM D; URRUTIA J et al.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 37-46; BIBL. 17 REF.Article

CIRCULAR PERMUTATION GRAPHSROTEM D; URRUTIA J.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 4; PP. 429-437; BIBL. 14 REF.Article

ALGORITHMS FOR SOME INTERSECTION GRAPHSKASHIWABARA T.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 108; PP. 171-181; BIBL. 22 REF.Conference Paper

ON THE INTERSECTION GRAPH OF A COMMUTATIVE DISTRIBUTIVE GROUPOIDPONDELICEK B.1979; MATH. SLOV.; CSK; DA. 1979; VOL. 29; NO 1; PP. 57-62; ABS. RUS; BIBL. 4 REF.Article

ON CHVATAL'S CONJECTURE RELATED TO A HEREDITARY SYSTEMSTEIN P.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 97-105; BIBL. 7 REF.Article

FORBIDDEN CONFIGURATIONS IN INTERSECTION GRAPHS OF R-GRAPHSGARDNER ML.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 31; NO 1; PP. 85-88; BIBL. 7 REF.Article

THE INTERSECTION GRAPH OF AN ORDERED COMMUTATIVE SEMIGROUPPONDELICEK B.1980; SEMIGR. FORUM; DEU; DA. 1980; VOL. 19; NO 3; PP. 213-218; BIBL. 6 REF.Article

Edge and vertex intersection of paths in a treeGOLUMBIC, M. C; JAMISON, R. E.Discrete mathematics. 1985, Vol 55, Num 2, pp 151-159, issn 0012-365XArticle

Ordres et géométrie plane : application au nombre de sauts = Orders and plane geometry : application to the jump numberCeroi, Stephan; Habib, Michel.2000, 116 p.Thesis

The edge intersection graphs of paths in a treeGOLUMBIC, M. C; JAMISON, R. E.Journal of combinatorial theory. Series B. 1985, Vol 38, Num 1, pp 8-22, issn 0095-8956Article

A combinatorial approach to complexityPUDLAK, P; RÖDL, V.Combinatorica (Print). 1992, Vol 12, Num 2, pp 221-226, issn 0209-9683Article

An intersection graph of straight linesTHOMASSEN, Carsten.Discrete mathematics. 2002, Vol 259, Num 1-3, pp 359-360, issn 0012-365X, 2 p.Article

The total interval number of a graph. I: Fundamental classesKRATZKE, T. M; WEST, D. B.Discrete mathematics. 1993, Vol 118, Num 1-3, pp 145-156, issn 0012-365XArticle

Subspace intersection graphsLAISON, JoshuaD; YULANQING.Discrete mathematics. 2010, Vol 310, Num 23, pp 3413-3416, issn 0012-365X, 4 p.Article

Interval bigraphs are unit grid intersection graphsRICHERBY, David.Discrete mathematics. 2009, Vol 309, Num 6, pp 1718-1719, issn 0012-365X, 2 p.Article

Indifference digraphs: a generalization of indifference graphs and semiordersSEN, M; SANYAL, B. K.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 157-165, issn 0895-4801Article

Fuzzy line graphsMORDESON, J. N.Pattern recognition letters. 1993, Vol 14, Num 5, pp 381-384, issn 0167-8655Article

Enumeration of acyclic walks in a graphBABIC, D; GRAOVAC, A.Discrete applied mathematics. 1993, Vol 45, Num 2, pp 117-123, issn 0166-218XArticle

Sphere of influence graphs: edge density and clique sizeMICHAEL, T. S; QUINT, T.Mathematical and computer modelling. 1994, Vol 20, Num 7, pp 19-24, issn 0895-7177Article

Subtree and substar intersection numbersYI-WU CHANG; JACOBSON, M. S; MONMA, C. L et al.Discrete applied mathematics. 1993, Vol 44, Num 1-3, pp 205-220, issn 0166-218XArticle

φ-threshold and φ-tolerance chain graphsJACOBSON, M. S; LEHEL, J; LESNIAK, L. M et al.Discrete applied mathematics. 1993, Vol 44, Num 1-3, pp 191-203, issn 0166-218XArticle

Implicit representation of graphsKANNAN, S; NAOR, M; RUDICH, S et al.SIAM journal on discrete mathematics (Print). 1992, Vol 5, Num 4, pp 596-603, issn 0895-4801Article

On the orthogonal Latin squares polytopeAPPA, G; MAGOS, D; MOUNOS, I et al.Discrete mathematics. 2006, Vol 306, Num 2, pp 171-187, issn 0012-365X, 17 p.Article